Double Blind T-Private Information Retrieval
نویسندگان
چکیده
منابع مشابه
A T-private K-database Private Information Retrieval Scheme
A private information retrieval scheme enables a user to privately recover an item from a public accessible database. In this paper we present a private information retrieval scheme for k repli-cated databases. The scheme is information-theoretically secure against coalitions of databases of size t k ? 1. It improves the communication complexity of the scheme described in 12] for coalitions of ...
متن کاملEfficient Private Information Retrieval
Informally, private information retrieval for k >= 1 databases (k-PIR) is an interactive scheme that enables a user to make access to (separated) k replicated copies of a database and privately retrieve any single bit out of the n bits of data stored in the database. In this model, “privacy” implies that the user retrieves the bit he is interested in but releases to each database nothing about ...
متن کاملPractical Private Information Retrieval
In recent years, the subject of online privacy has been attracting much interest, especially as more Internet users than ever are beginning to care about the privacy of their online activities. Privacy concerns are even prompting legislators in some countries to demand from service providers a more privacy-friendly Internet experience for their citizens. These are welcomed developments and in s...
متن کاملNearly Private Information Retrieval
A private information retrieval scheme is a protocol whereby a client obtains a record from a database without the database operators learning anything about which record the client requested. This concept is well studied in the theoretical computer science literature. Here, we study a generalization of this idea where we allow a small amount of information about the client’s intent to be leake...
متن کاملt-Private Information Retrieval Schemes Using Transitive Codes
This paper presents private information retrieval (PIR) schemes for coded storage with colluding servers, which are not restricted to maximum distance separable (MDS) codes. PIR schemes for general linear codes are constructed and the resulting PIR rate is calculated explicitly. It is shown that codes with transitive automorphism groups yield the highest possible rates obtainable with the propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Information Theory
سال: 2021
ISSN: 2641-8770
DOI: 10.1109/jsait.2021.3053481